On hybrid models of quantum finite automata
نویسندگان
چکیده
منابع مشابه
Quantum Finite Automata
Quantum finite automata (QFAs) are quantum counterparts of the usual finite automata. 1way QFAs recognize the same languages as conventional finite automata but can be exponentially more space-efficient. In this talk, we describe the main results about quantum finite automata and some possible areas for future work. In particular, we will discuss: • the languages for which QFAs can be smaller t...
متن کاملPostselection Finite Quantum Automata
Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...
متن کاملQuantum Finite Multitape Automata
Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [MC 97], and by A. Kondacs and J. Watrous [KW 97]. This notion is not a generalization of the deterministic finite automata. Moreover, in [KW 97] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [AF 98] proved that for some languages quantum finite automa...
متن کاملQuantum Finite Automata and Weighted Automata
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines th...
متن کاملQuantum Finite Automata and Weighted Automata
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2015.01.001